Bibtex of Graph / $k$-degenerate graph

@inproceedings{Bauer2010a, 
     address = "Austin, Texas, USA", 
     author = "Bauer, Reinhard and Krug, M and Wagner, D", 
     booktitle = "ANALCO 2010: the 7th Workshop on Analytic Algorithmics and Combinatorics", 
     doi = "10.1137/1.9781611973006.12", 
     editor = "Sedgewick, Robert and Golin, Mordecai", 
     isbn = "978-0-89871-933-8", 
     link = "http://epubs.siam.org/doi/book/10.1137/1.9781611973006", 
     month = "jan", 
     pages = "90--98", 
     publisher = "Society for Industrial and Applied Mathematics", 
     title = "Enumerating and Generating Labeled k-degenerate Graphs", 
     uri = "http://epubs.siam.org/doi/book/10.1137/1.9781611973006", 
     year = "2010", 
}

@inproceedings{Conte2017, 
     author = "Conte, Alessio and Kant{\'{e}}, Mamadou Moustapha and Otachi, Yota and Uno, Takeaki and Wasa, Kunihiro", 
     booktitle = "COCOON 2017: the 23rd Annual International Computing and Combinatorics Conference", 
     doi = "10.1007/978-3-319-62389-4_13", 
     editor = "Cao, Yixin and Chen, Jianer", 
     isbn = "978-3-319-62388-7_13", 
     link = "http://link.springer.com/10.1007/978-3-319-62389-4", 
     pages = "150--161", 
     publisher = "Springer International Publishing", 
     series = "Lecture Notes in Computer Science", 
     title = "Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph", 
     uri = "http://link.springer.com/10.1007/978-3-319-62389-4", 
     volume = "10392", 
     year = "2017", 
}

@inproceedings{Conte2019, 
     address = "New York, New York, USA", 
     author = "Conte, Alessio and Uno, Takeaki", 
     booktitle = "Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019", 
     doi = "10.1145/3313276.3316402", 
     isbn = "9781450367059", 
     pages = "1179--1190", 
     publisher = "ACM Press", 
     title = "{New polynomial delay bounds for maximal subgraph enumeration by proximity search}", 
     year = "2019", 
}